A Heuristic Solution for a Driver-Vehicle Scheduling Problem
نویسندگان
چکیده
A driver-vehicle scheduling problem in a limousines rental company is studied. Given a set of trip demands to be covered, the goal is to find a driver-vehicle schedule that covers as many as possible of the required demands while satisfying a set of imperative constraints and optimizing several cost objectives. A formulation of the problem is given and a solution approach using local search is developed.
منابع مشابه
A heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملA PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملDriver scheduling based on "driver-friendly" vehicle schedules
In the area of optimization of public transportation there are several methods for modeling and solving vehicle and driver scheduling problems. We designed a sequential heuristic method for solving the combined (vehicle and driver scheduling) problem. Our model is based on a modification of the vehicle schedules to satisfy driver requirements. We introduced a driver friendly approach of the opt...
متن کاملOptimal Design of the Cross-docking in Distribution Networks: Heuristic Solution Approach
A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005